Spherical rectangles

نویسندگان

  • Alexandre Eremenko
  • Andrei Gabrielov
چکیده

We study spherical quadrilaterals whose angles are odd multiples of π/2, and the equivalent accessory parameter problem for the Heun equation. We obtain a classification of these quadrilaterals up to isometry. For given angles, there are finitely many one-dimensional continuous families which we enumerate. In each family the conformal modulus is either bounded from above or bounded from below, but not both, and the numbers of families of these two types are equal. The results can be translated to classification of Heun’s equations with real parameters, whose exponent differences are odd multiples of 1/2, with unitary monodromy. MSC 2010: 34M03, 30C20, 35J91, 33E05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial approximation and quadrature on geographic rectangles

Using some recent results on subperiodic trigonometric interpolation and quadrature, and the theory of admissible meshes for multivariate polynomial approximation, we study product Gaussian quadrature, hyperinterpolation and interpolation on some regions of Sd, d ≥ 2. Such regions include caps, zones, slices and more generally spherical rectangles defined by longitudes and (co)latitudes (geogra...

متن کامل

A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

Faultfree Tromino Tilings of Rectangles

In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of crossing numbers for tilings and derive bounds on the crossing numbers of faultfree tilings. We develop an iterative scheme for generating faultfree tromino tilings for rectangles and derive the closed form expression for the exact number of faultfree...

متن کامل

Maximizing the area of intersection of rectangles

This paper attacks the following problem. We are given a large number N of rectangles in the plane, each with horizontal and vertical sides, and also a number r < N . The given list of N rectangles may contain duplicates. The problem is to find r of these rectangles, such that, if they are discarded, then the intersection of the remaining (N − r) rectangles has an intersection with as large an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016